Inductive Refinement of Casual Theories
نویسنده
چکیده
This paper collects ideas from causal analysis, analogical reasoning, empirical learning, and presents an integrated methodology to refining causal and social theories. Its major contribution is that the theory validation meth<Xl, which consists of an incremental process of generation and pruning of examples and counter examples, can work in the face of the two following limitations: (a) lack of prior knowledge, (b) lack of specific examples. The approach has been implemented in a program called IR89. We provide an example of 1R89 acting as an experimenter of social theories in the domain of Italian Renaissance history. Experimental investigations with "interesting" theories give the work more support.
منابع مشابه
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordination in multi-agent systems. We study generality relations in disjunctive default logic by comparing the amounts of information brought by default theories. Intuitively, a default theory is considered more general than ...
متن کاملIncremental Inductive Synthesis of Datalog Theories
This paper presents a logic framework for the incremental inductive synthesis of Datalog theories. It allows us to cast the problem as a process of abstract diagnosis and debugging of an incorrect theory. This process involves a search in a space, whose algebraic structure (conferred by the notion of object identity) makes easy the definition of algorithms that meet several properties that are ...
متن کاملGeneralizing Refinement Operators to Learn Prenex Conjunctive Normal Forms
Inductive Logic Programming considers almost exclusively universally quantied theories. To add expressiveness, prenex conjunctive normal forms (PCNF) with existential variables should also be considered. ILP mostly uses learning with refinement operators. To extend refinement operators to PCNF, we should first do so with substitutions. However, applying a classic substitution to a PCNF with exi...
متن کاملBuilding Theories into Instantiation
Instantiation orderings over formulas (the relation of one formula bemg an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning A variety of instantiation ordenngs are now IP use, many of which incorporate some k ind of background information in the form ...
متن کاملOn the Query Refinement in Searching a Bibliographic Database
In this paper we present an application of the logic-based query refinement in the searching for information in an information portal. The refinement approach is based on the discovery of causal relationships between queries regarding the inclusion relation between the answers of these queries. We define a formal model for the query-answering pairs and use methods from the inductive logic progr...
متن کامل